Pushing Constraints to Generate Top-K Closed Sequential Graph Patterns
نویسندگان
چکیده
In this paper, the problem of finding sequential patterns from graph databases is investigated. Two serious issues dealt in this paper are efficiency and effectiveness of mining algorithm. A huge volume of sequential patterns has been generated out of which most of them are uninteresting. The users have to go through a large number of patterns to find interesting results. In order to improve the efficiency and effectiveness of the mining process, constraints are more essential. Constraint-based mining is used in many fields of data mining such as frequent pattern mining, sequential pattern mining, and subgraph mining. A novel algorithm called CSGP (Constraint-based Sequential Graph Pattern mining) is proposed for mining interesting sequential patterns from graph databases. CSGP algorithm is revised to mine top-k closed patterns and named as TCSGP (Top-k Closed constraint-based Sequential Graph Pattern mining).
منابع مشابه
TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed graph patterns without minimum support. Most previous frequent graph pattern mining works require the specification of a minimum support threshold to perform the mining. However it is difficult for users to set a suitable value sometimes. We develop an efficient algorithm, called TGP, to mine patterns without minimum supp...
متن کاملSequential Pattern Mining by Pattern-Growth: Principles and Extensions
Sequential pattern mining is an important data mining problem with broad applications. However, it is also a challenging problem since the mining may have to generate or examine a combinatorially explosive number of intermediate subsequences. Recent studies have developed two major classes of sequential pattern mining methods: (1) a candidate generation-and-test approach, represented by (i) GSP...
متن کاملMining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min `, where k is the desired number of frequent closed patterns to be mined, and min ` is the minimal length of each pattern. An efficient algorithm, called TFP, is developed for mining such patterns without minimum support. Two methods, closed node count and descendant sum are proposed to...
متن کاملTKS: Efficient Mining of Top-K Sequential Patterns
Sequential pattern mining is a well-studied data mining task with wide applications. However, fine-tuning the minsup parameter of sequential pattern mining algorithms to generate enough patterns is difficult and timeconsuming. To address this issue, the task of top-k sequential pattern mining has been defined, where k is the number of sequential patterns to be found, and is set by the user. In ...
متن کاملMining Top-K Graph Patterns that Jointly Maximize Some Significance Measure
Most of graph pattern mining algorithms focus on finding frequent subgraphs and its compact representations, such as closed frequent subgraphs and maximal frequent subgraphs. However, little attention has been paid to mining graph patterns with user-specified significance measure. In this paper, we study a new problem of mining top-k graph patterns that jointly maximize some significance measur...
متن کامل